/**
 * Created with IntelliJ IDEA.
 * Description:
 * User: 刘远望
 * Date: 2025-05-16
 * Time: 13:15
 */
// 快乐数 力扣202
class Solution {
    public int bitSum(int n) {
        int sum = 0;
        while (n != 0) {
            int t = n % 10;
            sum += t * t;
            n /= 10;
        }
        return sum;
    }
    public boolean isHappy(int n) {
        int slow = n;
        int fast = bitSum(n);
        while (slow != fast) {

            slow = bitSum(slow);
            fast = bitSum(bitSum(fast));

        }

        return slow == 1;
    }
}